The degree ratio ranking method for directed graphs

One of the most famous ranking methods for digraphs is by Copeland score. The score a node in digraph difference between its outdegree (i.e. number outgoing arcs) and indegree ingoing arcs). In score, ranked higher, higher this paper, we deal with an alternative method to rank nodes according their out- indegree, namely degree ratio, i.e. divided indegree. To avoid dividing zero, add 1 both as well every node. We provide axiomatization ratio using clone property, which says that entrance or copy some sense similar original node) does not change among nodes. also new same axioms except satisfies different property. Finally, modify taking only but definition assume zero be than positive yet another property maximal way, can compare three